A Share-Correctable Protocol for the Shamir Threshold Scheme and Its Application to Participant Enrollment

نویسندگان

  • Raylin Tso
  • Ying Miao
  • Takeshi Okamoto
  • Eiji Okamoto
چکیده

Verifiable secret sharing schemes proposed so far can only allow participants to verify whether their shares are correct or not. In this paper, we propose a new protocol which can allow participants not only to verify the correctness of their shares but also to revise the faulty shares. It is achieved in a cooperative way by participants, but without any assistance from the dealer. This protocol, to the best of our knowledge, is the first one providing such kind of ability. Correcting shares by participants instead of the dealer is important in many situations. In addition, this protocol is also useful for adding new participants without the dealer’s assistance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

استفاده از توابع پایه‌ای قطعه‌ای ثابت متعامد در طرح آستانه شمیر (shamir)

In Shamir threshold scheme one that is called dealer, chooses the key and then shares some partial information about it, called among the participants, secretly. In this paper, we use some numerical methods with piecewise constant basis functions in Shamir threshold scheme. We first introduce operational matrix of this functions and then show how dealer multiplies this matrix by vector of share...

متن کامل

Security Analysis of a Hash-Based Secret Sharing Scheme

Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...

متن کامل

An Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things

Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...

متن کامل

An Online Verifiable and Detectable (t, n) Multi-Secret Sharing Scheme Based on HS-TS

In 1979, secret sharing schemes were first proposed by Blakley and Shamir. In a secret sharing scheme, each participant receives a share of a secret in such a way that only authorized subsets can reconstruct the secret. Later, Wu and He proposed a (t, n)-threshold scheme for sharing a secret based on a hyperspherical function (HS-TS). Their scheme give a practical algorithm to solve the problem...

متن کامل

Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme

In this paper, we investigate the problem of increasing the threshold parameter of the Shamir (t, n)-threshold scheme without interacting with the dealer. Our construction will reduce the problem of secret recovery to the polynomial reconstruction problem which can be solved using a recent algorithm by Guruswami and Sudan. In addition to be dealer-free, our protocol does not increase the commun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IACR Cryptology ePrint Archive

دوره 2005  شماره 

صفحات  -

تاریخ انتشار 2005